Mathematical Programs with Vanishing Constraints
نویسنده
چکیده
And out of the confusion Where the river meets the sea Something new would arrive Something better would arrive... " Acknowledgements The doctoral thesis at hand is the result of my research during the time as a Ph.D. student at the Department of Mathematics at the University of Würzburg. In a long-term project like this one, there are, of course, several ups and downs, and hence one is lucky to have a solid scientific and social environment. Therefore, I would like to take this opportunity to thank certain people who have helped me create this dissertation, directly or indirectly. First of all, I would like to express my deep gratitude to my supervisor Christian Kanzow for his superb scientific guidance through the past three years. He provided me with a very interesting and challenging research project, generously sharing his time and discussing new ideas. Moreover, I could substantially benefit from his great experience in the field of mathematical optimization which guided me carefully on the path which eventually led to this thesis. In addition to that, I would like to thank him for several joint publications which, clearly, had a big impact on the material presented here. Furthermore, through him, I got to know and collaborate with a couple of prominent researchers in my field of work like, for example, Jiří V. Outrata and Wolfgang Achtziger, where the latter also deserves my appreciation for agreeing to co-referee this disserta-tion. Apart from my supervisor there are some more persons to whom I owe my gratitude since this whole project could hardly have been realized this way if it had not been for their support. At this, first, I would like to thank my colleague Florian Möller for helping me with all kinds of technical questions, very amusing discussions about strength training and, after all, for being a really nice guy. A very special thanks goes to my closest friends: Cedric Essi, Christian Struck, and Neela Struck to whom I feel deeply indebted for caring through all the lows and also sharing the highs. Last but not least, I would like to thank my parents for generous financial support during my studies and my whole family (also including my sister Imke) for unrestrained emotional backup.
منابع مشابه
An SQP method for mathematical programs with vanishing constraints with strong convergence properties
We propose an SQP algorithm for mathematical programs with vanishing constraints which solves at each iteration a quadratic program with linear vanishing constraints. The algorithm is based on the newly developed concept of [Formula: see text]-stationarity (Benko and Gfrerer in Optimization 66(1):61-92, 2017). We demonstrate how [Formula: see text]-stationary solutions of the quadratic program ...
متن کاملActive-set Newton methods for mathematical programs with vanishing constraints
Mathematical programs with vanishing constraints constitute a new class of difficult optimization problems with important applications in optimal topology design of mechanical structures. Vanishing constraints usually violate standard constraint qualifications, which gives rise to serious difficulties in theoretical and numerical treatment of these problems. In this work, we suggest several glo...
متن کاملFirst- and Second-order Optimality Conditions for Mathematical Programs with Vanishing Constraints
We consider a special class of optimization problems that we call Mathematical Programs with Vanishing Constraints, MPVC for short, which serves as a unified framework for several applications in structural and topology optimization. Since an MPVC most often violates stronger standard constraint qualification, first-order necessary optimality conditions, weaker than the standard KKT-conditions,...
متن کاملMathematical programs with vanishing constraints: optimality conditions and constraint qualifications
We consider a difficult class of optimization problems that we call a mathematical program with vanishing constraints. Problems of this kind arise in various applications including optimal topology design problems of mechanical structures. We show that some standard constraint qualifications like LICQ and MFCQ usually do not hold at a local minimum of our program, whereas the Abadie constraint ...
متن کاملMathematical Programs with Vanishing Constraints: Optimality Conditions, Sensitivity, and a Relaxation Method
We consider a class of optimization problems with switch-off/switch-on constraints, which is a relatively new problem model. The specificity of this model is that it contains constraints that are being imposed (switched on) at some points of the feasible region, while being disregarded (switched off) at other points. This seems to be a potentially useful modeling paradigm, that has been shown t...
متن کاملCharacterization of Properly Efficient Solutions for Convex Multiobjective Programming with Nondifferentiable vanishing constraints
This paper studies the convex multiobjective optimization problem with vanishing constraints. We introduce a new constraint qualification for these problems, and then a necessary optimality condition for properly efficient solutions is presented. Finally by imposing some assumptions, we show that our necessary condition is also sufficient for proper efficiency. Our results are formula...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009